The length of dominating cycle of claw-free graph
نویسندگان
چکیده
منابع مشابه
determination of maximal singularity free zones in the workspace of parallel manipulator
due to the limiting workspace of parallel manipulator and regarding to finding the trajectory planning of singularity free at workspace is difficult, so finding a best solution that can develop a technique to determine the singularity-free zones in the workspace of parallel manipulators is highly important. in this thesis a simple and new technique are presented to determine the maximal singula...
15 صفحه اولTriangularly connected claw-free graph
A graph G is triangularly connected if for every pair of edges e1, e2 ∈ E(G), G has a sequence of 3-cycles C1, C2, · · · , Cl such that e1 ∈ C1, e2 ∈ Cl and such that E(Ci) ∩ E(Ci+1) 6= ∅, (1 ≤ i ≤ l − 1). In this paper it is shown that every triangularly connected claw-free graph G with |E(G)| ≥ 3 is vertex pancyclic. This implies the former results in [2], [3], [4] and [5] that every connecte...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولOn the Maximum Number of Dominating Classes in Graph Coloring
In this paper we investigate the dominating- -color number، of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and H. This result allows us to construct classes of graphs such that and thus provide some information regarding two questions raised in [1] and [2].
متن کاملDominating set is fixed parameter tractable in claw-free graphs
We show that the DOMINATING SET problem parameterized by solution size is fixed-parameter tractable (FPT) in graphs that do not contain the claw (K1,3, the complete bipartite graph on four vertices where the two parts have one and three vertices, respectively) as an induced subgraph. We present an algorithm that uses 2 2)nO(1) time and polynomial space to decide whether a claw-free graph on n v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mechanical Engineering
سال: 2017
ISSN: 1687-8140,1687-8140
DOI: 10.1177/1687814017737726